Processing maps for Fe–24Ni–11Cr–3Ti–1Mo superalloy

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Quantitative analysis of thermo-mechanical behavior in 414 stainless steel using flow curves and processing maps

The hot deformation behavior of a typical martensitic stainless steel containing 2.1% Ni was investigated by means of the compression test in the strain rate range of 0.001-1 s-1 and temperature range of 950-1150 °C. The flow behavior of the steel was evaluated using the flow stress curves and flow softening map and by microstructural investigation. Taking into account of the strain effect on t...

متن کامل

simulation and design of electronic processing circuit for restaurants e-procurement system

the poor orientation of the restaurants toward the information technology has yet many unsolved issues in regards to the customers. one of these problems which lead the appeal list of later, and have a negative impact on the prestige of the restaurant is the case when the later does not respond on time to the customers’ needs, and which causes their dissatisfaction. this issue is really sensiti...

15 صفحه اول

Proximity Point Properties for Admitting Center Maps

In this work we investigate a class of admitting center maps on a metric space. We state and prove some fixed point and best proximity point theorems for them. We obtain some results and relevant examples. In particular, we show that if $X$ is a reflexive Banach space with the Opial condition and $T:Crightarrow X$ is a continuous admiting center map, then $T$ has a fixed point in $X.$ Also, we ...

متن کامل

Entropy Estimate for Maps on Forests

A 1993 result of J. Llibre, and M. Misiurewicz, (Theorem A [5]), states that if a continuous map f of a graph into itself has an s-horseshoe, then the topological entropy of f is greater than or equal to logs, that is h( f ) ? logs. Also a 1980 result of L.S. Block, J. Guckenheimer, M. Misiurewicz and L.S. Young (Lemma 1.5 [3]) states that if G is an A-graph of f then h(G) ? h( f ). In this pap...

متن کامل

A taxonomy of Self-organizing Maps for temporal sequence processing

This paper presents a taxonomy for Self-organizing Maps (SOMs) for temporal sequence processing. Four main application areas for SOMs with temporal processing have been identified. These are prediction, control, monitoring and data mining. Three main techniques have been used to model temporal relations in SOMs: 1) pre-processing or post-processing the data, but keeping the basic SOM algorithm;...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Bulletin of Materials Science

سال: 2011

ISSN: 0250-4707,0973-7669

DOI: 10.1007/s12034-011-0107-3